On Job Fairness in Non-Preemptive Parallel Job Scheduling
نویسندگان
چکیده
Fairness is an important issue for parallel job scheduling policies, but has been ignored in most of previous studies. In this paper, we consider two different styles of job fairness: FCFS and EQ. Commonly used summary statistics are applied to different job measures to evaluate the fairness under a wide range of non-preemptive parallel job scheduling policies, including priority backfill policies and goal-oriented scheduling policies. Guided by intuition, we study what fairness measures may be appropriate for characterizing the fairness considered. The impact of fairness on other scheduling performance is also studied.
منابع مشابه
Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
We revisit the classic problem of preemptive scheduling on m uniformly related machines. In this problem, jobs can be arbitrarily split into parts, under the constraint that every job is processed completely, and that the parts of a job are not assigned to run in parallel on different machines. We study a new objective which is motivated by fairness, where the goal is to minimize the sum of the...
متن کاملSelective Preemption Strategies for Parallel Job Scheduling
Although theoretical results have been established regarding the utility of preemptive scheduling in reducing average job turnaround time, job suspension/restart is not much used in practice at supercomputer centres for parallel job scheduling. A number of questions remain unanswered regarding the practical utility of preemptive scheduling. We explore this issue through a simulation based study...
متن کاملStochastic Online Scheduling with Precedence Constraints
We consider the preemptive and non-preemptive problems of scheduling jobs with precedence constraints on parallel machines with the objective to minimize the sum of (weighted) completion times. We investigate an online model in which the scheduler learns about a job when all its predecessors have completed. For scheduling on a single machine, we show matching lower and upper bounds of Θ(n) and ...
متن کاملPreemptive Scheduling for Distributed Systems
Preemptive scheduling is widespread in operating systems and in parallel processing on symmetric multiprocessors. However, in distributed systems it is practically unheard of. Scheduling in distributed systems is an important issue, and has performance impact on parallel processing, load balancing and metacomputing. Non-preemptive scheduling can perform well if the task lengths and processor sp...
متن کاملAn Optimal Parallel Algorithm for Preemptive Job Scheduling that Minimizes Maximum Lateness
In this paper we present the Preemptive Minimize Maximum Lateness algorithm, an optimal parallel algorithm that schedules jobs for execution on a single processor machine with preemption. Each job is described by a release time, a deadline and a processing time. A job is considered late if it does not complete by its deadline and its lateness is defined as the difference between its completion ...
متن کامل